On the complexity of non-unique probe selection
نویسندگان
چکیده
We investigate the computational complexity of some basic problems regarding non-unique probe selection using separable matrices. In particular, we prove that the Minimal d̄-Separable Matrix problem is DP -complete, and the d̄-Separable Submatrix with Reserved Rows problem, which is a generalization of the decision version of the Minimum d̄-Separable Submatrix problem, is Σ2 -complete.
منابع مشابه
Non-unique probe selection and group testing
Aminimization problem that has arisen from the study of non-unique probe selection with group testing technique is as follows: Given a binary matrix, find a d-disjunct submatrix with the minimum number of rows and the same number of columns. We show that when every probe hybridizes to at most two viruses, i.e., every row contains at most two 1s, this minimization is still MAX SNP-complete, but ...
متن کاملOn the complexity and approximation of non-unique probe selection using d -disjunct matrix
In this paper, we studied the MINimum-d-Disjunct Submatrix (MIN-dDS), which can be used to select the minimum number of non-unique probes for viruses identification. We prove that MIN-d-DS is NP-hard for any fixed d . Using d-disjunct matrix, we present an O(log k)-approximation algorithm where k is an upper bound on the maximum number of targets hybridized to a probe. We also present a (1+ (d+...
متن کاملSequential Forward Selection Approach to the Non-unique Oligonucleotide Probe Selection Problem
In order to accurately measure the gene expression levels in microarray experiments, it is crucial to design unique, highly specific and highly sensitive oligonucleotide probes for the identification of biological agents such as genes in a sample. Unique probes are difficult to obtain for closely related genes such as the known strains of HIV genes. The non-unique probe selection problem is to ...
متن کاملA MULTI-OBJECTIVE OPTIMIZATION MODEL FOR PROJECT PORTFOLIO SELECTION CONSIDERING AGGREGATE COMPLEXITY: A CASE STUDY
Existing project selection models do not consider the complexity of projects as a selection criterion, while their complexity may prolong the project duration and even result in its failure. In addition, existing models cannot formulate the aggregate complexity of the selected projects. The aggregated complexity is not always equal to summation of complexity of projects because of possible syne...
متن کاملGeneralized multivalued $F$-contractions on non-complete metric spaces
In this paper, we explain a new generalized contractive condition for multivalued mappings and prove a fixed point theorem in metric spaces (not necessary complete) which extends some well-known results in the literature. Finally, as an application, we prove that a multivalued function satisfying a general linear functional inclusion admits a unique selection fulfilling the corresp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 390 شماره
صفحات -
تاریخ انتشار 2008